On interleaved sequences over finite fields
نویسندگان
چکیده
An (f(x); m)-interleaved sequence Gong (IEE Trans. Inform. Theory 41(2) (1995) 400) over a !nite !eld Fq is a sequence where all its m-decimated sequences have f(x) as the common characteristic polynomial, which can be determined by a control parameter. This paper demonstrates how issues such as minimal polynomial, linear span, period and correlation values of an (f(x); m)-interleaved sequence are related to its control parameter when f(x) is irreducible. Moreover, this paper shows how control parameters can be chosen to construct some sequences of maximal period and have optimal auto and cross correlation values among all the (f(x); m)-interleaved sequences when f(x) is primitive and m is less than the period of f(x). c © 2002 Elsevier Science B.V. All rights reserved.
منابع مشابه
Classical Wavelet Transforms over Finite Fields
This article introduces a systematic study for computational aspects of classical wavelet transforms over finite fields using tools from computational harmonic analysis and also theoretical linear algebra. We present a concrete formulation for the Frobenius norm of the classical wavelet transforms over finite fields. It is shown that each vector defined over a finite field can be represented as...
متن کاملStructure of finite wavelet frames over prime fields
This article presents a systematic study for structure of finite wavelet frames over prime fields. Let $p$ be a positive prime integer and $mathbb{W}_p$ be the finite wavelet group over the prime field $mathbb{Z}_p$. We study theoretical frame aspects of finite wavelet systems generated by subgroups of the finite wavelet group $mathbb{W}_p$.
متن کاملClassical wavelet systems over finite fields
This article presents an analytic approach to study admissibility conditions related to classical full wavelet systems over finite fields using tools from computational harmonic analysis and theoretical linear algebra. It is shown that for a large class of non-zero window signals (wavelets), the generated classical full wavelet systems constitute a frame whose canonical dual are classical full ...
متن کاملLong Period Sequences Generated by the Logistic Map over Finite Fields with Control Parameter Four
Recently, binary sequences generated by chaotic maps have been widely studied. In particular, the logistic map is used as one of the chaotic map. However, if the logistic map is implemented by using finite precision computer arithmetic, rounding is required. In order to avoid rounding, Miyazaki, Araki, Uehara and Nogami proposed the logistic map over finite fields, and show some properties of s...
متن کاملLinear Complexity of Some Binary Interleaved Sequences of Period 4N
It is necessary that the linear complexity of a key stream sequence in a stream cipher system is not less than half of a period. This paper puts forward the linear complexity of a class of binary interleaved sequences with period 4N over the finite field with characteristic 2. Results show that the linear complexity of some of these sequences satisfies the requirements of cryptography.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 252 شماره
صفحات -
تاریخ انتشار 2002